1 F eb 1 99 7 REAL FIELDS AND REPEATED RADICAL EXTENSIONS

نویسنده

  • I. M. Isaacs
چکیده

1. Introduction. Recall that a field extension F ⊆ L is said to be a radical extension if it is possible to write L = F [α], where α ∈ L is an element with α n ∈ F for some positive integer n. More generally, an extension F ⊆ L is a repeated radical extension if there exist intermediate fields L i with F = L 0 ⊆ L 1 ⊆ · · · ⊆ L r = L and such that each field L i is a radical extension of L i−1 for 0 < i ≤ r. Given a polynomial f (X) over a field F of characteristic zero, let S be a splitting field over F for f. Then as usual, we say that f is solvable by radicals if S is contained in some repeated radical extension of F. A celebrated theorem of Galois asserts that this occurs if and only if the associated Galois group Gal(S/F) is a solvable group. It is well known that intermediate fields of repeated radical extensions need not themselves be repeated radical extensions of the ground field. The solvability of Gal(S/F), therefore, does not guarantee that S is a repeated radical extension of F , and so the phrase " contained in " in the statement of Galois' theorem is essential. For example, take F = Q, the rational numbers, and consider the polynomial f (X) = X 3 − 6X + 2. It is easy to see that f has three real roots, and so we can take S ⊆ R. Of course, the cubic polynomial f is solvable by radicals; we can see this explicitly by calculating that the three roots of f are given by the formula r = α + 2/α, where α runs over the three complex cube roots of the complex number −1 + √ −7. If S were a repeated radical extension of Q, there would have to be some alternative way to express these roots in terms of real radicals. This is impossible, however, since f is easily seen to be irreducible, and it is a classical result that if an irreducible cubic polynomial has three real roots, then these roots definitely are not expressible in terms of real radicals. More generally, we have the following (known) result. (See [1] or Theorem 22.11 of [2]. Also, we include a somewhat simplified …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : m at h / 06 02 15 4 v 1 [ m at h . N T ] 8 F eb 2 00 6 What is the Inverse of Repeated Square and Multiply Algorithm ?

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not...

متن کامل

On the structure and dynamics of Ellerman bombs

Aims. We study the structure and dynamics of three Ellerman bombs (EBs) observed in an evolving active region. Methods. The active region NOAA 11271 was observed with the Vacuum Tower Telescope at Observatorio del Teide/Tenerife on August 18, 2011. We used the two-dimensional Triple Etalon SOlar Spectrometer (TESOS) to obtain time sequences of the active region and of EBs in Hα at a cadence of ...

متن کامل

Mathematical Aspects of Consciousness Theory

ions about.... The ordinary second quantized quantum physics corresponds only to thelowest level infinite primes. 2. The ordinary primes appearing as building blocks of infinite primes at the first level of thehierarchy could be identified as coding for p-adic primes assignable to fermionic and bosonicpartons identified as 2-surfaces of a given space-time sheet. The hierarchy of inf...

متن کامل

Micellar confinement of charged donor-acceptor system: A case of large MFE

It is well established that the magnetic field effect on the geminate recombination of radical pairs depend not only on the relative spin evolution of the two interacting radicals, but also on the spatial evolution.1–4) Empirically it is found that micellar confinement, which reduces the escape rate from a cage of appropriate dimension and which increases the probability of repeated collisions ...

متن کامل

2 00 7 What is the Inverse of Repeated Square and Multiply Algorithm ?

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997